Note on equitable colorings of graphs
نویسنده
چکیده
An equitable coloring of a graph G is a proper coloring of the vertices of G such that color classes differ in size by at most one. In this note, we verify the equitable coloring conjecture [W. Meyer, Amer. Math. Monthly 80 (1973), 920–922] for some classes of graphs which are defined by forbidden induced subgraphs using known results.
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملEquitable Colorings of Cartesian Product Graphs of Wheels with Complete Bipartite Graphs
By the sorting method of vertices, the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of wheels with bipartite graphs are obtained. Key–Words: Cartesian product, Equitable coloring, Equitable chromatic number, Equitable chromatic threshold
متن کاملEquitable Colorings of Cartesian Products of Fans with Bipartite Graphs
In this paper, by the sorting method of vertices, it is obtained that the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of fans with bipartite graphs.
متن کاملMinimum Reload Cost Cycle Cover in Complete Graphs
The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al. [1] introduced the Minimum Reload Cost Cycle Cover problem, which is to find a set of vertex-disjoint cycles spanning all vertices with minimum reload cost. They proved that this problem is strongly NP-hard and not appro...
متن کاملEquitable Online-Colorings of Random Graphs
A proper graph coloring is called equitable if the sizes of every two color classes differ by at most one. We consider the following generalized notion of graph colorings: a vertex coloring of graph G is valid w.r.t. some fixed nonempty graph F if no color class induces a copy of F in G, i.e., there is no monochromatic copy of F in G. We propose and analyze an algorithm for computing valid equi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 59 شماره
صفحات -
تاریخ انتشار 2014